THIRD SEMESTERlabSem 4
ALGORITHMS & DATA STRUCTURE - LAB
CSS 2105
Syllabus
- 01Reviewing the concepts of pointers, structures and recursion
- 02Studying the operation of stacks and queues and the associated application programs
- 03Creating dynamic allocation of memory for linked list and applying it to examples using singly, doubly and circular linked list and their applications
- 04Creation of binary trees and the application associated with the trees
- 05Implement a doubly linked list & BST
- 06GCD Techniques
- 07Bubble sort
- 08Selection sort
- 09Linear search
- 10String Matching
- 11sorting algorithms
- 12DFS
- 13BFS
- 14Topological sorting
- 15AVL tree
- 162-3 tree
- 17Horspool algorithm
- 18Open hash table
- 19Floyd's algorithm
- 20Warshall's algorithm
- 21Greedy Techniques
- 22Dijkstra's algorithm
- 23Backtracking
References
- Behrouz A. Forouzan, Richard F. Gilberg, A Structured Programming Approach Using C, (3e), Cengage Learning India Pvt. Ltd, India, 2007
- Ellis Horowitz, Sar taj Sahni, Susan Anderson and Freed, Fundamentals of Data Structures in C, (2e), Silicon Press, 2007
- Anany Levitin, Introduction to the Design and Analysis of Algorithms, (3e), Pearson Education, India, 2011
- Ellis Horowitz and Sartaj Sahni, Computer Algorithms/C++, (2e), University Press, 2007
- Thomas H. Cormen, Charles E. Leiserson, Ronal L, Rivest, Clifford Stein, Introduction to Algorithms, (2e), PHI, 2006
Credits Structure
0Lecture
0Tutorial
3Practical
1Total